Nondeterministic Descriptional Complexity Of Regular Languages
نویسندگان
چکیده
منابع مشابه
Descriptional Complexity of NFAs of Different Ambiguity
In this paper, we study the tradeoffs in descriptional complexity of NFA (nondeterministic finite automata) of various amounts of ambiguity. We say that two classes of NFA are separated if one class can be exponentially more succinct in descriptional sizes than the other. New results are given for separating DFA (deterministic finite automata) from UFA (unambiguous finite automata), UFA from MD...
متن کاملA Survey on Operational State Complexity
Descriptional complexity is the study of the conciseness of the various models representing formal languages. The state complexity of a regular language is the size, measured by the number of states of the smallest, either deterministic or nondeterministic, finite automaton that recognises it. Operational state complexity is the study of the state complexity of operations over languages. In thi...
متن کاملMore on Deterministic and Nondeterministic Finite Cover Automata - Extended Abstract
Finite languages are an important sub-regular language family, which were intensively studied during the last two decades in particular from a descriptional complexity perspective. An important contribution to the theory of finite languages are the deterministic and the recently introduced nondeterministic finite cover automata (DFCAs and NFCAs, respectively) as an alternative representation of...
متن کاملAutomaticity II: Descriptional Complexity in the Unary Case
Let Z and d be finite alphabets, and let f be a map from C* to A. Then the deterministic automaticity of f, &(n), is defined to be the size of the minimum finite-state machine that correctly computes f on all inputs of size <n. A similar definition applies to languages L. We denote the nondeterministic analogue (for languages L) of automaticity by NL(~). In a previous paper, Shallit and Breitba...
متن کاملResults on the Average State and Transition Complexity of Finite Automata Accepting Finite Languages (Extended Abstract)
The study of descriptional complexity issues for finite automata dates back to the mid 1950’s. One of the earliest results is that deterministic and nondeterministic finite automata are computationally equivalent, and that nondeterministic finite automata can offer exponential state savings compared to deterministic ones, see [11]—by the powerset construction one increases the number of states ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Found. Comput. Sci.
دوره 14 شماره
صفحات -
تاریخ انتشار 2003